Combinatorial explosion and the effectiveness of mining results are the essential challenges of meaningful pattern extraction, a Maximal Fuzzy Frequent Pattern Tree Algorithm (MFFP-Tree) based on base-(second-order-effect) pattern structure and uncertainty consideration of items was proposed. Firstly, the fuzziness of items was analyzed comprehensively, the fuzzy support was given, and the fuzzy weight of items in the transaction data set was analyzed, the candidate item set was trimmed according to the fuzzy pruning strategy. Secondly, the database was scanned once to build FFP-Tree, and the overhead of pattern extraction was reduced based on fuzzy pruning strategy. The FFP-array structure was used to streamline the search method to further reduce the space and time complexity. The experimental results gained from the benchmark datasets reveal that the proposed MFFP-Tree has outstanding performance by comparing with PADS and FPMax ^* algorithms:the time complexity of the proposed algorithm is optimized by twice to one order of magnitude for different datasets, and the spatial complexity of the proposed algorithm is optimized by one order of magnitude to two orders of magnitude, respectively.

In practical application, Modified Gain Extended Kalman Filter (MGEKF) algorithm generally uses erroneous measured values instead of the real values for calculation, so the modified results also contain errors. To solve this problem, an improved MGEKF algorithm based on Back Propagation Neural Network (BPNN), termed BPNN-MGEKF algorithm, was proposed in this paper. At BPNN training time, measured values were used as the input, and modified results by true values as the output. BPNN-MGEKF was applied to single moving station bearing-only position experiment. The experimental results shows that, BPNN-MGEKF improves the positioning accuracy of more than 10% compared to extended Kalman filter, MGEKF and smoothing modified gain extended Kalman filter algorithm, and it is more stable.